Approximate belief updating in max-2-connected Bayes networks is NP-hard
نویسندگان
چکیده
A max-2-connected Bayes network is one where there are at most 2 distinct directed paths between any two nodes. We show that even for this restricted topology, null-evidence belief updating is hard to approximate.
منابع مشابه
Belief Network Algorithms: A Study of Performance
Belief Updating Algorithms There are several algorithms for exact belief updating, for example, the polytree algorithm, clustering (Pearl 1988) or the Jensen tree method (Jensen, Lauritzen, & Olesen 1989). However, approximate methods are often preferred because the complexity of exact updating is NP-hard. Approximate updating is usually done by stochastic simulation (Pearl 1988). Variants incl...
متن کاملBelief Network Inference Algorithms: a Study of Performance Based on Domain Characterisation
In recent years belief networks have become a popular representation for reasoning under uncertainty and are used in a wide variety of applications. There are a number of exact and approximate inference algorithms available for performing belief updating, however in general the task is NP-hard. To overcome the problems of computational complexity that occur when modelling larger, real-world pro...
متن کاملBinarization Algorithms for Approximate Updating in Credal Nets
Credal networks generalize Bayesian networks relaxing numerical parameters. This considerably expands expressivity, but makes belief updating a hard task even on polytrees. Nevertheless, if all the variables are binary, polytree-shaped credal networks can be efficiently updated by the 2U algorithm. In this paper we present a binarization algorithm, that makes it possible to approximate an updat...
متن کاملGeneralized loopy 2U: A new algorithm for approximate inference in credal networks
Credal nets generalize Bayesian nets by relaxing the requirement of precision of probabilities. Credal nets are considerably more expressive than Bayesian nets, but this makes belief updating NP-hard even on polytrees. We develop a new efficient algorithm for approximate belief updating in credal nets. The algorithm is based on an important representation result we prove for general credal nets...
متن کاملApproximating MAPs for Belief Networks is NP-Hard and Other Theorems
Finding rna.ximum a posteriori (MAP) assignments, also called Most Probable Explanations, is an important problem on Bayesian belief networks. Shimony has shown that finding MAPS is NPhard. In this paper, we show that approximating MAPS with a constant ratio bound is also NP-hard. In addition. we examine the complexity of two related problems which have been mentioned in the literature. We show...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Artif. Intell.
دوره 173 شماره
صفحات -
تاریخ انتشار 2009